منابع مشابه
Robust Surface Reconstruction from Noisy Point Clouds using Graph Cuts
This work is concerned with the implementation and evaluation of a surface reconstruction approach, which is highly robust against outliers. The chosen approach has a range of appealing properties. First of all, it manages to incorporate a keypoint-based visibility constraint, which leads to a very high resilience to outliers. Secondly, it is based on a Delaunay triangulation, which makes the a...
متن کاملIterative Concept Learning from Noisy Data Iterative Concept Learning from Noisy Data
In the present paper, we study iterative learning of indexable concept classes from noisy data. We distinguish between learning from positive data only and learning from positive and negative data; synonymously, learning from text and informant, respectively. Following 20], a noisy text (a noisy informant) for some target concept contains every correct data item innnitely often while in additio...
متن کاملRobust ensemble learning for mining noisy data streams
a Institute of Computing Technology, Chinese Academy of Sciences, Beijing, 100190, China b Centre for Quantum Computation & Intelligent Systems, University of Technology Sydney, Broadway, NSW 2007, Australia c Research Center on Fictitious Economy and Data Science, Chinese Academy of Sciences, Beijing, China d College of Information Science & Technology, Univ. of Nebraska at Omaha, Omaha, NE 68...
متن کاملLearning GP-trees from Noisy Data
We discuss the problem of model selection in Genetic Programming using the framework provided by Statistical Learning Theory, i.e. Vapnik-Chervonenkis theory (VC). We present empirical comparisons between classical statistical methods (AIC, BIC) for model selection and the Structural Risk Minimization method (based on VC-theory) for symbolic regression problems. Empirical comparisons of differe...
متن کاملA Learning to Rank from Noisy Data
Learning to Rank, which learns the ranking function from training data, has become an emerging research area in information retrieval and machine learning. Most existing work on learning to rank assumes that the training data is clean, which is, however, not always true. The ambiguity of query intent, the lack of domain knowledge, and the vague definition of relevance levels, all make it diffic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2020
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2018.2887094